Comparing expressibility of normed BPA and normed BPP processes
نویسندگان
چکیده
منابع مشابه
Normed BPA vs. Normed BPP Revisited
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process. This improves the previously known exponential upper bound by Černá, Křet́ınský, Kučera (1999). The algorithm relies on a polynomial bound for the “finite-state core” of the transition system generated by the BPP process. The bound is derived from the “prime form” of the underlying...
متن کاملComplexity of deciding bisimilarity between normed BPA and normed BPP
Article history: Available online: 20 June 2010
متن کاملRegularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time
We consider the problem of deciding regularity of normed BPP and normed BPA processes. A process is regular if it is bisimilar to a process with finitely many states. We show that regularity of normed BPP and normed BPA processes is decidable in polynomial time and we present constructive regularity tests. Combining these two results we obtain a rich subclass of normed PA processes (called sPA)...
متن کاملBranching Bisimilarity of Normed BPA Processes as a Rational Monoid
The aim is to highlight and elaborate the structural result for branching bisimilarity on normed BPA (Basic Process Algebra) processes that was the crux of a conference paper by Czerwiński and Jančar (arxiv 7/2014 and LiCS 2015 [CJ-2014,2015]). That paper focused on the computational complexity, and a NEXPTIME-upper bound has been derived; the authors built on the ideas by Fu (ICALP 2013), and ...
متن کاملBranching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Kučera and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1999
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s002360050159